Description: kruscal算法求最小生成树算法
欢迎大家使用-kruscal algorithm for the minimum spanning tree algorithm Everyone is welcome to use Platform: |
Size: 943 |
Author:王小斌 |
Hits:
Description: 1.kruscal_CDT: 在Eclipse里面的CDT和MinGW(提供gcc)的环境下所编写的。
2.kruscal_VC2005: 在VC2005里面编写的。
3.以上两个的代码有点不同,区别主要在于compare函数
4.kruscal算法里面，我有两个不同的实现，一个是最小化堆里面放EdgeNode的指针，一个是最小化堆里面放EdgeNode的Object实例。前者使用了compare函数来比较大小，后者则是在EdgeNode的class里面重载运算符。-1.kruscal_CDT : in the Eclipse CDT inside and MinGW (provide gcc) and the environment under prepared. 2.kruscal_VC2005 : VC2005 inside prepared. 3. These two somewhat different from the code, between principal function is to compare 4.kruscal algorithm inside, I have two different implementations, 1 is the smallest of EdgeNode pile up inside the target, 1 is the smallest of EdgeNode pile up inside the Object examples. The former use the compare function to compare size, the latter is in the class inside EdgeNode Heavy Operators. Platform: |
Size: 983909 |
Author:gfoto |
Hits:
Description: 另一种有效的Kruscal算法,可以算20个点的情形-another effective Kruscal algorithm, can count 20 points of the case Platform: |
Size: 3699 |
Author:刘豪 |
Hits:
Description: kruscal的源代码，实现最小生成树的算法，这个是本人自己编的小程序。-kruscal the source code to achieve the minimum spanning tree algorithm, this is my own small part of the process. Platform: |
Size: 948 |
Author:涂奎 |
Hits:
Description: kruscal的源代码，实现最小生成树的算法，这个是本人自己编的小程序。-kruscal the source code to achieve the minimum spanning tree algorithm, this is my own small part of the process. Platform: |
Size: 1024 |
Author:涂奎 |
Hits:
Description: kruscal算法求最小生成树算法
欢迎大家使用-kruscal algorithm for the minimum spanning tree algorithm Everyone is welcome to use Platform: |
Size: 1024 |
Author:王小斌 |
Hits:
Description: 1.kruscal_CDT: 在Eclipse里面的CDT和MinGW(提供gcc)的环境下所编写的。
2.kruscal_VC2005: 在VC2005里面编写的。
3.以上两个的代码有点不同,区别主要在于compare函数
4.kruscal算法里面，我有两个不同的实现，一个是最小化堆里面放EdgeNode的指针，一个是最小化堆里面放EdgeNode的Object实例。前者使用了compare函数来比较大小，后者则是在EdgeNode的class里面重载运算符。-1.kruscal_CDT : in the Eclipse CDT inside and MinGW (provide gcc) and the environment under prepared. 2.kruscal_VC2005 : VC2005 inside prepared. 3. These two somewhat different from the code, between principal function is to compare 4.kruscal algorithm inside, I have two different implementations, 1 is the smallest of EdgeNode pile up inside the target, 1 is the smallest of EdgeNode pile up inside the Object examples. The former use the compare function to compare size, the latter is in the class inside EdgeNode Heavy Operators. Platform: |
Size: 984064 |
Author:gfoto |
Hits:
Description: 另一种有效的Kruscal算法,可以算20个点的情形-another effective Kruscal algorithm, can count 20 points of the case Platform: |
Size: 3072 |
Author:刘豪 |
Hits:
Description: Kruscal算法实现产生最小生成树，适用学习二叉树的朋友-Kruscal have a minimum spanning tree algorithm, the application of learning tree friends Platform: |
Size: 1024 |
Author:li |
Hits:
Description: 1．显示图的邻接矩阵, 图的邻接表, 深度优先遍历, 广度优先遍历, 最小生成树PRIM算法, 最小生成树KRUSCAL算法,图的连通分量。
2．当用户选择的功能错误时，系统会输出相应的提示。
3．通过图操作的实现，把一些实际生活中的具体的事物抽象出来-Shown FIG s adjacency matrix, graph the adjlink, depth-first traversal, breadth first traverse, minimum spanning tree minimum spanning tree PRIM algorithm, KRUSCAL algorithm, graph the connected components.
2. When the user chooses function mistake, the system will be output corresponding hints.
3. Through the realization of the operation, the graph of some actual life in the specific things abstract out Platform: |
Size: 1024 |
Author:江洋 |
Hits:
Description: 快排并查集Kruscal算法+源码 txt
快排并查集Kruscal算法+源码 txt-Row and fast algorithm+ source code search set Kruscal txt row and check the set Kruscal fast algorithm+ source code txt Platform: |
Size: 1024 |
Author:wjt |
Hits:
Description: （1） 掌握图的邻接矩阵、邻接表、十字链表等不同存储形式的表示方法。
（2） 掌握图的两种不同遍历方法的基本思想并能编程实现。
（3） 掌握构造最小生成树的两种算法，即Prim 算法和Kruscal算法的思想，并能编程实现。
（4） 能够灵活运用图的相关算法解决相应的实际问题。
-(1) master the adjacency matrix, adjacency list, cross-linked forms of representation of different storage methods. (2) two different master plans through the basic idea and can be programmed. (3) control construct two algorithms for minimum spanning tree, that Prim algorithm and Kruscal algorithm ideas, and to programming. (4) flexibility to use the corresponding graph-related algorithms to solve practical problems. Platform: |
Size: 1024 |
Author:yuan li |
Hits:
Description: 本软件围绕无向图的应用这一主题，用图形化的界面实现了无向图的建立、显示邻接表、动态构造最小生成树（分别利用Prim算法和Kruscal算法）、查找最短路径等功能。
具体功能：
给定一个图，完成：
（1） 建立并显示出它的邻接链表
（2） 分别用普里姆算法和克鲁斯卡尔算法构造其最小生成树，随时显示其构造的过程
（3） 给出某一确定顶点到所有其他顶点的最短路径
（4） 给出每一对顶点之间的最短路径
说明：程序开发时所用的文件和源码在文件夹“配套文件”中提供。另附说明文档。-This software around the theme of directed graph, use the graphical interface to achieve the establishment of an undirected graph, showing the adjacent table, the dynamic construction of minimum spanning tree (Prim algorithm and Kruscal algorithm), find the shortest path.
Specific features:
Given a graph, complete:
(1) to establish and demonstrate its adjacency lists
(2) the algorithm of Prim and Kruskal algorithm construct the minimum spanning tree, ready to show the process of its construction
(3) gives the shortest path to determine a vertex to all other vertices
(4) gives the shortest path between each pair of vertices
Description: used in program development and source files in the folder "supporting documents". Attach a separate sheet document. Platform: |
Size: 3050496 |
Author:lsc |
Hits:
Search - kruscal algorithm